Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
نویسندگان
چکیده
منابع مشابه
Polynomial identity testing of read-once oblivious algebraic branching programs
We study the problem of obtaining efficient, deterministic, black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an efficient, deterministic, white-box polynomial identity testing algorithm (due to Raz and Shpilka [RS05]), but prior to this work there was no known such black-box algorithm. The main result...
متن کاملDeterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who considered sums of k read-once formulas (Σk-RO-formulas). We show that Σk-RO-ABPs are strictly more powerful than Σk-RO-formulas, for any k ≤ ⌊n/2⌋, where n is the number of variables. Nevertheless, as a starting observat...
متن کاملIdentity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
We give improved hitting sets for two special cases of Read-once Oblivious Arithmetic Branching Programs (ROABP). First is the case of an ROABP with known order of the variables. The best previously known hitting set for this case had size (nw)O(logn) where n is the number of variables and w is the width of the ROABP. Even for a constantwidth ROABP, nothing better than a quasi-polynomial bound ...
متن کاملLower Bounds for Nondeterministic Semantic Read-Once Branching Programs
We prove exponential lower bounds on the size of semantic read-once 3-ary nondeterministic branching programs. Prior to our result the best that was known was for D-ary branching programs with |D| ≥ 213. 1998 ACM Subject Classification F.2.3 Tradeoffs between Complexity Measures
متن کاملLower bounds for restricted read-once parity branching programs
We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open problem. The following variant is well–motivated more general than variants for that lower bounds...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2018
ISSN: 1942-3454,1942-3462
DOI: 10.1145/3170709